Suborbits in Infinite Primitive Permutation Groups
نویسندگان
چکیده
For every infinite cardinal κ, we construct a primitive permutation group which has a finite suborbit paired with a suborbit of size κ. This answers a question of Peter M. Neumann.
منابع مشابه
Distinguishability of Infinite Groups and Graphs
The distinguishing number of a group G acting faithfully on a set V is the least number of colors needed to color the elements of V so that no non-identity element of the group preserves the coloring. The distinguishing number of a graph is the distinguishing number of its automorphism group acting on its vertex set. A connected graph Γ is said to have connectivity 1 if there exists a vertex α ...
متن کاملInfinite Bounded Permutation Groups
This work concerns permutation groups on uncountable sets. The environment is ZFC, Set Theory with Axiom of Choice. Therefore the cardinal numbers are wellordered, a cardinal number k is infinite if and only if Ko < k, and each cardinal number k has a unique successor k. Throughout the paper Cl will be a set (usually infinite), n its cardinality, and m a cardinal number less than n. The support...
متن کاملPrimitive permutation groups of bounded orbital diameter
We give a description of infinite families of finite primitive permutation groups for which there is a uniform finite upper bound on the diameter of all orbital graphs. This is equivalent to describing families of finite permutation groups such that every ultraproduct of the family is primitive. A key result is that, in the almost simple case with socle of fixed Lie rank, apart from very specif...
متن کاملOn imprimitive rank 3 permutation groups
A classification is given of rank 3 group actions which are quasiprimitive but not primitive. There are two infinite families and a finite number of individual imprimitive examples. When combined with earlier work of Bannai, Kantor, Liebler, Liebeck and Saxl, this yields a classification of all quasiprimitive rank 3 permutation groups. Our classification is achieved by first classifying imprimi...
متن کاملSporadic homogeneous structures
We discuss Lachlan’s classification theory for finite homogeneous structures and related problems on finite permutation groups. Lachlan’s theory provides a hierarchy of classifications in which structures which are “sporadic” in one context reappear as members of infinite families at later stages. Every finite structure is accounted for at some level in this hierarchy, but for structures associ...
متن کامل